# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def sumOddLengthSubarrays(self, arr: List[int]) -> int:
        ans = 0
        array_len = len(arr)

        pre_sums = [0] * (array_len + 1)
        for i in range(array_len):
            pre_sums[i+1] = pre_sums[i] + arr[i]

        for i in range(array_len):
            for j in range(i, array_len):
                if (j - i + 1) % 2 != 0:
                    ans += pre_sums[j + 1] - pre_sums[i]

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 4, 2, 5, 3], 58),
        ([1, 2], 3),
        ([10, 11, 12], 66)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.sumOddLengthSubarrays(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

